Dynamic Nearest Neighbor Queries in Euclidean Space
نویسندگان
چکیده
Given a query point q and a set D of data points, a nearest neighbor (NN) query returns the data point p in D that minimizes the distance DIST(q,p), where the distance function DIST(,) is the L2 norm. One important variant of this query type is kNN query, which returns k data points with the minimum distances. When taking the temporal dimension into account, the kNN query result may change over a period of time due to changes in locations of the query point and/or data points. Formally, the k-nearest neighbor (kNN) query is defined as follows.
منابع مشابه
Reverse nearest neighbor queries in fixed dimension
Reverse nearest neighbor queries are defined as follows: Given an input point-set P , and a query point q, find all the points p in P whose nearest point in P ∪ {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O(log n).
متن کاملSpace-Time Tradeoffs for Proximity Searching in Doubling Spaces
We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound ε > 0. The objective is to build a data structure so that given any query point q in the space, it is possible to efficiently determine a point of S whose distance from q is within a factor of (1 + ε) of the distance between q and...
متن کاملar X iv : 0 90 5 . 44 41 v 1 [ cs . C G ] 2 7 M ay 2 00 9 Reverse nearest neighbor queries in fixed dimension ∗
Reverse nearest neighbor queries are defined as follows: Given an input point-set P , and a query point q, find all the points p in P whose nearest point in P ∪ {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O(log n).
متن کاملApproximate Nearest Neighbor Queries in Fixed Dimensions 1
Given a set of n points in d-dimensional Euclidean space, S E d , and a query point q 2 E d , we wish to determine the nearest neighbor of q, that is, the point of S whose Euclidean distance to q is minimum. The goal is to preprocess the point set S, such that queries can be answered as eeciently as possible. We assume that the dimension d is a constant independent of n. Although reasonably goo...
متن کاملFoundations of Nearest Neighbor Queries in Euclidean Space
A number of approaches to computing nearest neighbor queries in Euclidean space are presented. This includes the depth-first and best-first methods as well as a comparison. The best first method is shown to be capable of being extended to report the neighboring objects in increasing order from the query object so that the search can be incremental and there is no need to know the value of k in ...
متن کامل